A Three-Step Transition-Based System for Non-Projective Dependency Parsing
نویسندگان
چکیده
This paper presents a non-projective dependency parsing system that is transition-based and operates in three steps. The three steps include one classical method for projective dependency parsing and two inverse methods predicting separately the right and left non-projective dependencies. Splitting the parsing allows to increase the scores on both projective and non-projective dependencies compared to state-of-the-art non-projective dependency parsing. Moreover, each step is performed in linear time.
منابع مشابه
Sorting Out Dependency Parsing
This paper explores the idea that non-projective dependency parsing can be conceived as the outcome of two interleaved processes, one that sorts the words of a sentence into a canonical order, and one that performs strictly projective dependency parsing on the sorted input. Based on this idea, a parsing algorithm is constructed by combining an online sorting algorithm with an arc-standard trans...
متن کاملExact Inference for Generative Probabilistic Non-Projective Dependency Parsing
We describe a generative model for nonprojective dependency parsing based on a simplified version of a transition system that has recently appeared in the literature. We then develop a dynamic programming parsing algorithm for our model, and derive an insideoutside algorithm that can be used for unsupervised learning of non-projective dependency trees.
متن کاملTransition-Based Parsing
Transition-based models for dependency parsing use a factorization defined in terms of a transition system, or abstract state machine. In this lecture, I will introduce the arc-eager and arcstandard transition systems for dependency parsing (§1) and discuss two different approaches to learning and decoding with these models: greedy classifier-based parsing (§2) and beam search and structured le...
متن کاملDivisible Transition Systems and Multiplanar Dependency Parsing
Transition-based parsing is a widely used approach for dependency parsing that combines high efficiency with expressive feature models. Many different transition systems have been proposed, often formalized in slightly different frameworks. In this article, we show that a large number of the known systems for projective dependency parsing can be viewed as variants of the same stack-based system...
متن کاملGetting the Most out of Transition-based Dependency Parsing
This paper suggests two ways of improving transition-based, non-projective dependency parsing. First, we add a transition to an existing non-projective parsing algorithm, so it can perform either projective or non-projective parsing as needed. Second, we present a bootstrapping technique that narrows down discrepancies between gold-standard and automatic parses used as features. The new additio...
متن کامل